A Deterministic Construction of Normal Bases With Complexity O(n3 + n log n log(log n) log q)
نویسندگان
چکیده
منابع مشابه
StUSPACE(log n) <= DSPACE(log²n / log log n)
We present a deterministic algorithm running in space O ? log 2 n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملRuspace(log N) Dspace(log 2 N= Log Log N) 1
We present a deterministic algorithm running in space O log2 n= log log n solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملRuspacelog N Dspacelog 2 N= Log Log N
We present a deterministic algorithm running in space O log n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.
متن کاملAn n log n Alogrithm for Deterministic Kripke Structure Minimization
We introduce an algorithm for the minimization of deterministic Kripke structures with O(kn log2 n) time complexity. We prove the correctness and complexity properties of this algorithm.
متن کاملColoring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors
Recently, Pawlik et al. have shown that triangle-free intersection graphs of line segments in the plane can have arbitrarily large chromatic number. Specifically, they construct triangle-free segment intersection graphs with chromatic number Θ(log log n). Essentially the same construction produces Θ(log log n)-chromatic triangle-free intersection graphs of a variety of other geometric shapes—th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1995
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1019